Channel Assignment Problem in Cellular Systems: A New Model and a Tabu Search Algorithm
نویسندگان
چکیده
The channel assignment in cellular systems has the task of planning the reuse of available frequencies in a spectrum efficient way. A classical approach to frequency assignment problems, when applied to the frequency planning of cellular networks, does not enable this task to be performed in an efficient way, since it does not consider the cumulative effect of interferers. In the paper, we propose a new model for the channel assignment problem in narrow-band cellular networks, which accounts for the cumulative effect of interferers. In this model, the service area is partitioned into regions and the propagation characteristics are assigned by means of the levels received in each region by the considered base stations (BS’s). The objective is to maximize the sum of traffic loads offered by regions in which the ratio between the received power and the sum of powers received from interfering transmissions is above a threshold value. In the paper, we also present an algorithm, based on tabu search (TS) techniques, to solve this problem. This algorithm has been tested on some instances obtained by using a simple radio channel model and on a real world instance.
منابع مشابه
Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملOptimal channel assignment in cellular systems using tabu search
The channel assignment problem (CAP) in cellular systems has the task of planning the reuse of the limited available frequencies in a spectrum-efficient and interference-minimal way. We adopt an integer programming representation of the static channel assignment (SCA) formulated by Smith and Palaniswami. A tabu search (TS) algorithm is implemented to solve this problem. Two forms of tabu list a...
متن کاملAPPLICATION OF TABU SEARCH FOR SOLVING THE BI-OBJECTIVE WAREHOUSE PROBLEM IN A FUZZY ENVIRONMENT
The bi-objective warehouse problem in a crisp environment is often not eective in dealing with the imprecision or vagueness in the values of the problem parameters. To deal with such situations, several researchers have proposed that the parameters be represented as fuzzy numbers. We describe a new algorithm for fuzzy bi-objective warehouse problem using a ranking function followed by an applic...
متن کاملThe P-Center Problem under Uncertainty
Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming...
متن کاملApplication of Tabu Search to Optimal Placement of Distributed Generation and Reactive Power Sources
Introducing distributed generation into a power system can lead to numerous benefits including technical, economic, environmental, etc. To attain these benefits, distributed generators with proper rating should be installed at suitable locations. Given the similar effects of distributed generators and capacitor banks on operation indices of a distribution system, simultaneous assignment of best...
متن کامل